全文获取类型
收费全文 | 219篇 |
免费 | 5篇 |
国内免费 | 4篇 |
专业分类
化学 | 8篇 |
综合类 | 1篇 |
数学 | 214篇 |
物理学 | 5篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2017年 | 3篇 |
2016年 | 1篇 |
2015年 | 1篇 |
2014年 | 4篇 |
2013年 | 7篇 |
2012年 | 3篇 |
2011年 | 5篇 |
2010年 | 6篇 |
2009年 | 6篇 |
2008年 | 14篇 |
2007年 | 12篇 |
2006年 | 7篇 |
2005年 | 21篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 12篇 |
2001年 | 17篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 7篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 16篇 |
1984年 | 10篇 |
1982年 | 2篇 |
1981年 | 1篇 |
排序方式: 共有228条查询结果,搜索用时 15 毫秒
1.
超尺寸物品装箱问题及其算法 总被引:3,自引:0,他引:3
本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法,我们提出了一个评价效率更高的目标函数,证明了在此目标函数下两步法的渐近最坏比不小于2,并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA,证明了在新目标函数下其渐近最坏比不超过7/4。 相似文献
2.
The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective. 相似文献
3.
A tomographic reconstruction method based on Monte Carlo random searching guided by the information contained in the projections
of radiographed objects is presented. In order to solve the optimization problem, a multiscale algorithm is proposed to reduce
computation. The reconstruction is performed in a coarse-to-fine multigrid scale that initializes each resolution level with
the reconstruction of the previous coarser level, which substantially improves the performance. The method was applied to
a real case reconstructing the internal structure of a small metallic object with internal components, showing excellent results. 相似文献
4.
A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics. 相似文献
5.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
6.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
7.
F. Sibel Salman Jayant R. Kalagnanam Sesh Murthy Andrew Davenport 《Journal of Heuristics》2002,8(2):215-239
For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of this method is examined by solving six difficult instances of a bicriteria sparse multiple knapsack problem. Results indicate that such tailored algorithms uniformly improve solutions as compared to using predesigned heuristic algorithms. 相似文献
8.
9.
The meta kaolin (MK) clay particulate filler with different weight ratios viz., 0, 5, 10, 20 and 30 wt% were incorporated into castable polyurethane (PU)/polystyrene (PS) (90/10) interpenetrating polymer network (IPN). The effects of MK particulate filler loading on the mechanical and thermal properties of PU/PS (90/10) IPN composites have been studied. From the tensile behavior, it was noticed that a significant improvement in tensile strength and tensile modulus as an increase in MK filler content. Thermogravimetric analysis (TGA) data reveals the marginal improvement in thermal stability after incorporation of MK filler. TGA studies of the IPN composites have been performed in order to establish the thermal stability and their mode of thermal degradation. It was found that degradation of all composites takes place in two steps. Degradation kinetic parameters were obtained for the composites using three mathematical models. Tensile fractured composite specimens were used to analyze the morphology of the composites by scanning electron microscopic (SEM) technique. 相似文献
10.
Philippe Galinier 《Discrete Applied Mathematics》2008,156(2):267-279
Let G=(V,E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1,…,k}) to each vertex of G so that no edge has both endpoints with the same color. The adaptive memory algorithm is a hybrid evolutionary heuristic that uses a central memory. At each iteration, the information contained in the central memory is used for producing an offspring solution which is then possibly improved using a local search algorithm. The so obtained solution is finally used to update the central memory. We describe in this paper an adaptive memory algorithm for the k-coloring problem. Computational experiments give evidence that this new algorithm is competitive with, and simpler and more flexible than, the best known graph coloring algorithms. 相似文献